LCF-style Platform based on Multiway Decision Graphs
نویسندگان
چکیده
منابع مشابه
LCF-style Platform based on Multiway Decision Graphs
The combination of state exploration approach (mainly model checking) and deductive reasoning approach (theorem proving) promises to overcome the limitation and to enhance the capabilities of each. In this paper, we are interested in defining a platform for Multiway Decision Graphs (MDGs) in LCF-style theorem prover. We define a platform to represent the MDG operations: conjunction, disjunction...
متن کاملLCF-style for Secure Verification Platform based on Multiway Decision Graphs
Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deductive reasoning (theorem proving). Indeed, the combination of the two approaches, states exploration and deductive reasoning promises to overcome the limitation and to enhance the capabilities of each. A comparison between both c...
متن کاملAutomaton based Model Checking Using Multiway Decision Graphs
Abstract. In this paper we present a formal hardware verification tool implementing an automata based model checking algorithm using Multiway Decision Graphs. The tool first transforms the property formula into a Generalized Buchi Automaton. It then uses a newly developed algorithm to check the language emptiness on the product machine composed from the system under verification and the constru...
متن کاملMultiway Decision Graphs for Automated Hardware Verification
Traditional ROBDD-based methods of automated veri cation su er from the drawback that they require a binary representation of the circuit. To overcome this limitation we propose a broader class of decision graphs, called Multiway Decision Graphs (MDGs), of which ROBDDs are a special case. With MDGs, a data value is represented by a single variable of abstract type, rather than by 32 or 64 boole...
متن کاملScalable LCF-Style Proof Translation
All existing translations between proof assistants have been notoriously sluggy, resource-demanding, and do not scale to large developments, which has lead to the general perception that the whole approach is probably not practical. We aim to show that the observed inefficiencies are not inherent, but merely a deficiency of the existing implementations. We do so by providing a new implementatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.07.012